A New Vertex Similarity Metric for Community Discovery: a Local Flow Model

نویسندگان

  • Yueping Li
  • Yunming Ye
  • Xiaolin Du
چکیده

The hierarchical clustering methods based on vertex similarity have the advantage that global evaluation can be incorporated for community discovery. Vertex similarity metric is the most important part of these methods. However, the existing methods do not perform well for community discovery compared with the state-ofthe-art algorithms. In this paper, we propose a new vertex similarity metric based on local flow model, called Local Flow Metric (LFM), for community discovery. LFM considers both the number of connecting paths and the local edge density which are essential measures in community structure. Compared with the existing metrics of vertex similarity, LFM outperforms substantially in community discovery quality and the computing time. Furthermore, our LFM algorithm is superior to the state-of-the-art algorithms in some aspects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modified variable physical properties model, for analyzing nanofluids flow and heat transfer over nonlinearly stretching sheet

In this paper, the problem of laminar nanofluid flow which results from the nonlinear stretching of a flat sheet is investigated numerically. In this paper, a modified variable physical properties model for analyzing nanofluids flow and heat transfer is introduced. In this model, the effective viscosity, density, and thermal conductivity of the solid-liquid mixture (nanofluids) which are common...

متن کامل

Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks

In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...

متن کامل

An Effective Approach for Robust Metric Learning in the Presence of Label Noise

Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...

متن کامل

On Learning Mixed Community-specific Similarity Metrics for Cold-start Link Prediction

We study the cold-start link prediction problem where edges between vertices is unavailable by learning vertex-based similarity metrics. Existing metric learning methods for link prediction fail to consider communities which can be observed in many real-world social networks. Because di↵erent communities usually exhibit di↵erent intra-community homogeneities, learning a global similarity metric...

متن کامل

Capturing Missing Links in Social Networks Using Vertex Similarity

The vertex similarity measure is a useful tool to discover and justify the relationship of vertices in a complex network. We propose the Relation Strength Similarity (RSS), a new vertex similarity measure that utilizes the network topology to discover similar vertices. Compared to other vertex similarity measures, RSS has the following advantages. First, it is an asymmetric metric which allows ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011